DBC: a condensed representation of frequent patterns for efficient mining
نویسندگان
چکیده
منابع مشابه
DBC: a condensed representation of frequent patterns for efficient mining
Given a large set of data, a common data mining problem is to extract the frequent patterns occurring in this set. The idea presented in this paper is to extract a condensed representation of the frequent patterns called disjunction-bordered condensation (DBC), instead of extracting the whole frequent pattern collection. We show that this condensed representation can be used to regenerate all f...
متن کاملEfficient Frequent Pattern Mining Based on a Condensed Tree Structure
In this paper, we present an efficient tree structure and its associated algorithm for discovery of frequent patterns from a large data set. We demonstrate the effectiveness of our algorithm and performance improvement over the existing approach CATS which is one of the fastest frequent pattern mining algorithms known to date.
متن کاملEfficient Indexing Structures for Mining Frequent Patterns
In this paper, we propose a variant of the signature file, called Bit-Sliced Bloom-Filtered Signature File (BBS), as the basis for implementing filter-and-refine strategies for mining frequent patterns. In the filtering step, the candidate patterns are obtained by scanning BBS instead of the database. The resultant candidate set contains a superset of the frequent patterns. In the refinement ph...
متن کاملAn efficient algorithm for mining frequent inter-transaction patterns
In this paper, we propose an efficient method for mining all frequent inter-transaction patterns. The method consists of two phases. First, we devise two data structures: a dat-list, which stores the item information used to find frequent intertransaction patterns; and an ITP-tree, which stores the discovered frequent inter-transaction patterns. In the second phase, we apply an algorithm, calle...
متن کاملExMiner: An Efficient Algorithm for Mining Top-K Frequent Patterns
Conventional frequent pattern mining algorithms require users to specify some minimum support threshold. If that specified-value is large, users may lose interesting information. In contrast, a small minimum support threshold results in a huge set of frequent patterns that users may not be able to screen for useful knowledge. To solve this problem and make algorithms more user-friendly, an idea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Systems
سال: 2003
ISSN: 0306-4379
DOI: 10.1016/s0306-4379(03)00002-4